Resolving Noun Compounds with Multi-Use Domain Knowledge
نویسندگان
چکیده
In this paper we describe a system for semantic interpretation of noun compounds that relies on world and domain knowledge from a knowledge base. This architecture combines domain-independent compounding rules with a task-independent knowledge representation, allowing both components to be flexibly reused. We present examples from Scientific American text, on which the system was developed, and then describe an exercise that tests the portability of the architecture to a new domain: email text on the topic of conference planning.
منابع مشابه
Disambiguating Noun Compounds With Latent Semantic Indexing
Technical terms in text often appear as noun compounds, a frequently occurring yet highly ambiguous construction whose interpretation relies on extra-syntactic information. Several statistical methods for disambiguating compounds have been reported in the literature, often with quite impressive results. However, a striking feature of all these approaches is that they rely on the existence of pr...
متن کاملWhich Noun Phrases Denote Which Concepts?
Resolving polysemy and synonymy is required for high-quality information extraction. We present ConceptResolver, a component for the Never-Ending Language Learner (NELL) (Carlson et al., 2010) that handles both phenomena by identifying the latent concepts that noun phrases refer to. ConceptResolver performs both word sense induction and synonym resolution on relations extracted from text using ...
متن کاملUsing Word Similarity Lists For Resolving Indirect Anaphora
In this work we test the use of word similarity lists for anaphora resolution in Portuguese corpora. We applied an automatic lexical acquisition technique over parsed texts to identify semantically similar words. After that, we made use of this lexical knowledge to resolve coreferent definite descriptions where the head-noun of the anaphor is different from the head-noun of its antecedent, whic...
متن کاملClassifying the Semantic Relations in Noun Compounds via a Domain-Specific Lexical Hierarchy
We are developing corpus-based techniques for identifying semantic relations at an intermediate level of description (more specific than those used in case frames, but more general than those used in traditional knowledge representation systems). In this paper we describe a classification algorithm for identifying relationships between two-word noun compounds. We find that a very simple approac...
متن کاملAutomatic Identification of Bengali Noun-Noun Compounds Using Random Forest
This paper presents a supervised machine learning approach that uses a machine learning algorithm called Random Forest for recognition of Bengali noun-noun compounds as multiword expression (MWE) from Bengali corpus. Our proposed approach to MWE recognition has two steps: (1) extraction of candidate multi-word expressions using Chunk information and various heuristic rules and (2) training the ...
متن کامل